منابع مشابه
The k-FEATURE SET problem is W[2]-complete
We prove the W [2]-completeness of the feature subset selection problem when the cardinality of the subset is the parameter. Aside from the many applications the problem has in the data mining literature, the problem is highly relevant in Computational Biology since it arises in differential gene expression analysis using microarray technologies. It is also related to genetic-based prognosis an...
متن کاملThe minimum feature set problem
One approach to improving the generalization power of a neural net is to try to minimize the number of non-zero weights used. We examine two issues relevant to this approach, for single-layer nets. First we bound the VC dimension of the set of linearthreshold functions that have non-zero weights for at most s of n inputs. Second, we show that the problem of minimizing the number of non-zero inp...
متن کاملThe Isomorphism Problem for k-Trees Is Complete for Logspace
We show that, for k constant, k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. The algorithm computes a unique tree decomposition, uses colors to fully encode the structure of the original graph in the decomposition tree and invokes Lindell’s tree canonization algorithm. As a consequence, the isomorphism, the automorphism, as well as the ...
متن کاملPushPush-k is PSPACE-Complete
We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a finite grid. Each grid position is either empty or occupied by a single obstacle block. While moving, the robot may push obstacle blocks in direction of its movement, subject to certain constraints. In particular, once an obstacle block starts moving, it continues to...
متن کاملDeciding the K-Dimension is PSPACE-Complete
In 1988 Littlestone introduced the optimal mistake-bound learning model to learning theory. In this model the difficulty of learning a concept from a concept class is measured by the K-dimension of the concept class, which is a purely combinatorial notion. This is similar to the situation in PAC-learning, where the difficulty of learning can be measured by the Vapnik-Červonenkis dimension. We s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00081-3